Function problems for Quantified Boolean Formulas

نویسندگان

  • S. Coste-Marquis
  • H. Fargier
  • J. Lang
  • D. Le Berre
چکیده

The practical use of Quantified Boolean Formulas (QBFs) often calls for more than solving the evaluation problem QBF. For this reason we investigate the corresponding function problem FQBF. We define expected outputs of FQBF instances as solution policies. We focus on the representation of policies, considering QBFs of the form ∀X ∃Y Φ. Because the explicit representation of policies for such QBFs can be of exponential size, descriptions as compact as possible must be looked for. To address this issue, two approaches based on the decomposition and the compilation of Φ are presented.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dichotomy Theorems for Alternation-Bounded Quantified Boolean Formulas

In 1978, Schaefer proved his famous dichotomy theorem for generalized satisfiability problems. He defined an infinite number of propositional satisfiability problems, showed that all these problems are either in P or NP-complete, and gave a simple criterion to determine which of the two cases holds. This result is surprising in light of Ladner’s theorem, which implies that there are an infinite...

متن کامل

An Alternative Representation for QBF

Quantified Boolean formulas are a powerful representation that have been used to capture and solve a variety of problems in Artificial Intelligence. While most research has focused on quantified Boolean formulas in prenex normal form (QBF), we explore an alternative representation of quantified Boolean formulas, called Constrained Quantified Formulas (CQF). CQF allows for a more direct represen...

متن کامل

Representing Policies for Quantified Boolean Formulas

The practical use of Quantified Boolean Formulas (QBFs) often calls for more than solving the validity problem QBF. For this reason we investigate the corresponding function problems whose expected outputs are policies. QBFs which do not evaluate to true do not have any solution policy, but can be of interest nevertheless; for handling them, we introduce a notion of partial policy. We focus on ...

متن کامل

The threshold for random (1,2)-QSAT

The QSAT problem is the quantified version of the SAT problem. We show the existence of a threshold effect for the phase transition associated with the satisfiability of random quantified extended 2-CNF formulas. We consider boolean CNF formulas of the form ∀X∃Y ϕ(X, Y), where X has m variables, Y has n variables and each clause in ϕ has one literal from X and two from Y. For such formulas , we...

متن کامل

Extracting Certificates from Quantified Boolean Formulas

A certificate of satisfiability for a quantified boolean formula is a compact representation of one of its models which is used to provide solverindependent evidence of satisfiability. In addition, it can be inspected to gather explicit information about the semantics of the formula. Due to the intrinsic nature of quantified formulas, such certificates demand much care to be efficiently extract...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003